Domino Fibonacci Tableaux

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domino Fibonacci Tableaux

In 2001, Shimozono and White gave a description of the domino Schensted algorithm of Barbasch, Vogan, Garfinkle and van Leeuwen with the “color-to-spin” property, that is, the property that the total color of the permutation equals the sum of the spins of the domino tableaux. In this paper, we describe the poset of domino Fibonacci shapes, an isomorphic equivalent to Stanley’s Fibonacci lattice...

متن کامل

Some Bijective Correspondences Involving Domino Tableaux

We elaborate on the results in [CaLe]. We give bijective proofs of a number of identities that were established there, in particular between the Yamanouchi domino tableaux and the Littlewood-Richardson tableaux that correspond to the same tensor product decomposition. 1991 Mathematics Subject Classification: 05E10.

متن کامل

Two Results on Domino and Ribbon Tableaux

Inspired by the spin-inversion statistic of Schilling, Shimozono and White [8] and Haglund et al. [2] we relate the symmetry of ribbon functions to a result of van Leeuwen, and also describe the multiplication of a domino function by a Schur function.

متن کامل

Plactic relations for r-domino tableaux

The recent work of Bonnafé et al. [2] shows through two conjectures that r-domino tableaux have an important role in Kazhdan-Lusztig theory of type B with unequal parameters. In this paper we provide plactic relations on signed permutations which determine whether given two signed permutations have the same insertion r-domino tableaux in Grafinkle’s algorithm [3]. Moreover, we show that a parti...

متن کامل

Domino tableaux, Schützenberger involution, and the symmetric group action

We define an action of the symmetric group S[ n 2 ] on the set of domino tableaux, and prove that the number of domino tableaux of weight β does not depend on the permutation of the weight β. A bijective proof of the well-known result due to J. Stembridge that the number of self–evacuating tableaux of a given shape and weight β = (β1, . . . , β[ n+1 2 ], β[ n2 ], . . . , β1), is equal to that o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2006

ISSN: 1077-8926

DOI: 10.37236/1071